The minimum semidefinite rank of a triangle-free graph
نویسندگان
چکیده
منابع مشابه
Polytopes of Minimum Positive Semidefinite Rank
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k × k real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a polytope is at least the dimension of the polytope plus one, and we characterize those polytopes whose psd rank equals this lower bound.
متن کاملThe minimum number of 4-cliques in a graph with triangle-free complement
Let f (n; 4; 3) be minimum number of 4 cliques in a graph of order n with independence number 2: We show that f (n; 4; 3) 1 200 n +O n : We also show if a graph of order n has independence number 2 and is close to regular then it has at least 1 200 n + o n 4-cliques. 1 Notation and conventions Our notation and terminology are standard (see, e.g. [1]). In particular, all graphs are assumed to be...
متن کاملAn upper bound for the minimum rank of a graph
For a graph G of order n, the minimum rank of G is defined to be the smallest possible rank over all real symmetric n × n matrices A whose (i, j)th entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. We prove an upper bound for minimum rank in terms of minimum degree of a vertex is valid for many graphs, including all bipartite graphs, and conjecture this bound ...
متن کاملApproximating the minimum rank of a graph via alternating projection
The minimum rank problem asks to find the minimum rank over all matrices with given pattern associated with a graph. This problem is NP-hard, and there is no known approximation method. In this article, a numerical algorithm is given to heuristically approximate the minimum rank using alternating projections. The effectiveness of this algorithm is demonstrated by comparing its results to a rela...
متن کاملMaximum Order of Triangle-Free Graphs with a Given Rank
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle-free graphs with a given rank and characterize all such graphs achieving the maximum order.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2011
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.11.052